Approximability of Virtual Machine Allocation: Much Harder than Bin Packing

نویسنده

  • Zoltán Ádám Mann
چکیده

The allocation of virtual machines (VMs) to physical machines in data centers is a key optimization problem for cloud service providers. It is well known that the VM allocation problem contains the classic bin packing problem as special case. This paper investigates to what extent the existing approximability results on bin packing and its generalizations can be applied to the VM allocation problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximizing SLA and QoE in Heterogeneous Cloud Computing Environment

Cloud Computing delivers users a proficient way to dynamically allocate computing resources to meet demands. The use of Server virtualization techniques for Cloud Computing platforms provide great elasticity with the capability to consolidate several virtual machines on the same physical server, to resize a virtual machine capacity and to migrate virtual machine across physical servers. A key c...

متن کامل

Novel Resource Allocation Algorithm for Energy-Efficient Cloud Computing in Heterogeneous Environment

Energy efficiency is one of the most important design considerations for a cloud data center. Recent approaches to the energy-efficient resource management for data centers usually model the problem as a bin packing problem with the goal of minimizing the number of physical machines (PMs) employed. However, minimizing the number of PMs may not necessarily minimize the energy consumption in a he...

متن کامل

Solving the Multi-Resource Bin Packing Problem with a Reordering Grouping Genetic Algorithm

We formally define multi-resource bin packing, a generalization of conventional bin packing, and develop an algorithm called Reordering Grouping Genetic Algorithm (RGGA) to solve this problem. Multi-resource bin packing can be applied to different problems, such as placing virtual machines onto servers. We first test RGGA on conventional bin packing problems and show that it yields excellent re...

متن کامل

More than bin packing: Dynamic resource allocation strategies in cloud data centers

Resource allocation strategies in virtualized data centers have received considerable attention recently as they can have substantial impact on the energy efficiency of a data center. This led to new decision and control strategies with significant managerial impact for IT service providers. We focus on dynamic environments where virtual machines need been analyzed and used to place virtual mac...

متن کامل

Multidimensional Bin Packing and Other Related Problems: A Survey

The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. The problem is extremely important in practice and finds numerous applications in scheduling, routing and resource alloca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015